/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e6 + 100;
ll a[maxn];
ll n, k, p;

bool check(ll w)
{
    ll t;
    for (ll i = w + 1; i <= n; i++)
    {
        if (a[i] != a[i - w])
        {
            t = i;
            break;
        }
    }
    if (n - t + 1 + w < k + p)
    {
        k = n - t + 1;
        p = w;
        return true;
    }
    return false;
}

int main()
{
    IOS;
    cin >> n;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    reverse(a + 1, a + 1 + n);
    ll l = 1, r = n;
    k = maxn;
    while (l <= r)
    {
        ll mid = (l + r) >> 1;
        if (check(mid))
        {
            r = mid - 1;
        }
        else
            l = mid + 1;
    }
    cout << k << " " << p << endl;
    getchar();
    getchar();
    return 0;
}
